Efficient Processing of k-Hop Reachability Queries on Directed Graphs

Given a directed graph, k-hop reachability query, u→?kv, is used to check for the existence of path from u v that has length at most k. Addressing queries fundamental task in graph theory and been extensively investigated. However, existing algorithms can be inefficient when answering because they require costly traversal operations. To improve query performance, we propose an approach based on vertex cover. We construct index covers all information using small set vertices input graph. This allows us answer without performing traversal. linear-time algorithm quickly compute cover, S, which use develop novel labeling scheme two efficient answering. The experimental results demonstrate our significantly outperforms approaches terms response time.